//Accepted
#include <cstdio>
#include <cstring>
#define MAXN 1121
int n, i, j, k;
//bool c[MAXN];
//int sizeP, p[200];
int sizeP, p[187] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117};
int t[15][MAXN], x;

int main(){
	//freopen("in.txt", "r", stdin);//freopen("out.txt", "w", stdout);
	
	// memset(c,1,sizeof(c));
	// for(sizeP=0,i=2;i<MAXN;++i){
		// if(c[i]){
			// p[ sizeP++ ]=i;
			// printf("%d, ", i);
			// for(j=i;j<MAXN;j+=i)c[j]=0;
		// }
	// }
	sizeP=187;
	
	
	memset(t,0,sizeof(t));
	for(k=0;k<sizeP;++k){
		x=p[k];
		for(i=1120;i>1;--i){
			if(t[0][i]){
				for(j=1;j<14;++j){
					if(t[j][i]&&(x+i<MAXN)){
						t[j+1][x+i]+=t[j][i];
						t[0][x+i]=1;
					}
				}
			}
		}
		t[0][x]=t[1][x]=1;
	}
	
	scanf("%d%d", &n, &k);
	while(n+k){
		printf("%d\n", t[k][n]);
		scanf("%d%d", &n, &k);
	}
	return 0;
}
